This paper deals with the selection of Optimal layout variants of planetary transmissions designed for operation as Light Electric Vehicle main gearboxes. The required transmission ratio was calculated, and the Optimal two-carrier gear train with two connecting and three external shafts selected. A computer program was used for structural synthesis and to determine the required basic parameters of the component gear trains. The ring gear reference diameter was used to rank the layout variants according to size, with the smallest variants also ranked according to the calculated efficiency ratio. Finally, an Optimal variant of the planetary gear train for light electric vehicle application is proposed. The procedure proposed in this paper may be expanded to other applications.

The determination of locations and sizes for such a system is important in a drainage master plan or a storm-water management system. However, the distribution of detentions in the upstream and midstream is often more dispersed using many combinations of volume scales. This paper uses the non-dominated sorting genetic algorithm combined with the Storm Water Management Model to explore and calculate the Optimal layout scheme for decentralized rainwater detention. The purpose is to find a design and planning method that can achieve the Optimal balance of decentralized detention considering the aspects of flood disaster control, peak flow reduction, and investment cost. The Optimal results of Pareto in applied case show that among the five most unfavourable nodes, the detentions with different layout volumes and relatively smaller size can control water logging from rainstorm. The project cost is effectively reduced and the standard of the return period of the regional rainwater system is enhanced from 2 to 20 years.

Optimization of the volume/weight in the gear train is of great importance for industries and researchers. In this paper, using the particle swarm optimization algorithm, a general gear train is optimized. The main idea is to optimize the volume/weight of the gearbox in 3 directions. To this end, the optimization process based on the PSO algorithm occurs along the height, length, and width of the gearbox to achieve the smallest possible gearbox. The constraints are divided into three types named geometrical, design and control constraints. The optimization process is presented for two and three-stage gear trains and by choosing different values for the gear ratio, input power and hardness of gears. The practical graphs for the optimum value of the weight/volume and all necessary design parameters of gearbox such as the number of stages, position, modulus of gears, face width of gears, and diameter of shafts are also presented. The results are validated by comparing with the results reported in the previous publications.

This paper focuses on layout modeling and optimization for a space control system. Majority of recent research works consider design components as constant elements over time. A new approach based on variable mass components is proposed in this paper for which the objective function is to minimize mass center variation (MCV) range over time. The proposed approach consists of Human-computer interaction (HCI) and Optimization methods to perform the layout. In the modeling phase, using defined inputs, all system components are determined. In the next step, mathematical model of achieved layout is defined. Mathematical model includes objective function, constraints, variables and parameters, play an important role in choosing appropriate optimization method. Based on mathematical model and design space, a gradient optimization method is selected. By applying this algorithm, optimum layout is proposed. Results of optimization and HCI design are compared. Comparison of the results shows that the optimization technique can significantly improve the results of the layout problem. At last, the results have analyzed and validated with similar research works. The results comparison show more efficiency and accuracy for the proposed method.

In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehicles (AGV). To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Programming (ILP) is determined. The objective functions of both algorithms are to find the shortest path. The path must be connected and incident to all cells at least in one edge or node. A simple Branch-and-Cut approach is used to solve the ILP models. Computational results show that the models easily can solve the problem with less than 45 cells using a commercial ILP solver.